Provable security of block ciphers against linear cryptanalysis: a mission impossible?
نویسندگان
چکیده
منابع مشابه
Provable Security of Block Ciphers Against Linear Cryptanalysis - a Mission Impossible? An Experimental Review of the Practical Security Approach and the Key Equivalence Hypothesis in Linear Cryptanalysis
In this paper, we are concerned with the security of block ciphers against linear cryptanalysis and discuss the distance between the so-called practical security approach and the actual theoretical security provided by a given cipher. For this purpose, we present a number of illustrative experiments performed against small (i.e. computationally tractable) ciphers. We compare the linear probabil...
متن کاملOn a Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
We introduce a new methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable security, and th...
متن کاملNew Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Abst rac t . We introduce a methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable securit...
متن کاملProvable Security against Impossible Differential Cryptanalysis Application to CS-Cipher
In this document we present a new way to bound the probability of occurrence of an n-round differential in the context of differential cryptanalysis. Hence this new model allows us to claim proof of resistance against impossible differential cryptanalysis, as defined by Biham and al. in 1999. This work will be described through the example of CS-Cipher, to which, assuming some non-trivial hypot...
متن کامل"Provable" Security against Differential and Linear Cryptanalysis
In this invited talk, a brief survey on the developments of countermeasures against differential and linear cryptanalysis methods is presented. 1 Nonlinearity of S-boxes Throughout the eighties the unpublished design criteria of the DES had inspired various authors to invent formal nonlinearity criteria for S-boxes such as the strict avalanche criterion [30] and the propagation criterion [27]. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2008
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-008-9234-2